#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
queue<int> q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    memset(a,0,sizeof(a));
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    int sum=0;
    a[0]=-1;
    a[n+1]=-1;
    for(int i=1;i<=n+1;i++)
    {
        if(a[i]!=a[i-1])
        {
            q.push(sum);
            sum=1;
        }
        else sum++;
    }
    q.pop();
    int g=q.front();
    q.pop();
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        g=max(g,p);
    }
    printf("%d",g);
    return 0;
}
/*

*/
